Junction-Based Geographic Routing Algorithm for Vehicular Ad hoc Networks

Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to the destination. If a local optimum is reached, a recovery strategy is applied, the key point of which is our proposed minimum angle method. We evaluate the performance of our routing protocol in real city topology. The simulated scenarios use obstacle modelling and several different Physical layer settings. Simulation results show that our proposal achieves superior performance compared to the well-known Greedy Perimeter Coordinator Routing (GPCR) algorithm.